#include <bits/stdc++.h>
using namespace std;

const int N = 100010;

int n;
int a[N], b[N];

int main ()
{
    freopen ("duel.in", "r", stdin);
    freopen ("duel.out", "w", stdout);

    scanf ("%d", &n);
    for (int i = 1; i <= n; i ++ ) scanf ("%d", a + i), b[a[i]] ++;

    int res = 0;
    for (int i = 1; i < N; i ++ )
        if (b[i] != 0)
            if (res > b[i]) res = abs (res - b[i]) + b[i];
            else res = b[i];

    printf ("%d", res);

    return 0;
}
